全文获取类型
收费全文 | 2539篇 |
免费 | 125篇 |
国内免费 | 240篇 |
专业分类
化学 | 190篇 |
力学 | 40篇 |
综合类 | 45篇 |
数学 | 2501篇 |
物理学 | 128篇 |
出版年
2024年 | 2篇 |
2023年 | 21篇 |
2022年 | 29篇 |
2021年 | 23篇 |
2020年 | 38篇 |
2019年 | 55篇 |
2018年 | 56篇 |
2017年 | 52篇 |
2016年 | 65篇 |
2015年 | 44篇 |
2014年 | 109篇 |
2013年 | 167篇 |
2012年 | 90篇 |
2011年 | 112篇 |
2010年 | 111篇 |
2009年 | 167篇 |
2008年 | 197篇 |
2007年 | 157篇 |
2006年 | 147篇 |
2005年 | 140篇 |
2004年 | 97篇 |
2003年 | 113篇 |
2002年 | 94篇 |
2001年 | 98篇 |
2000年 | 87篇 |
1999年 | 85篇 |
1998年 | 81篇 |
1997年 | 75篇 |
1996年 | 59篇 |
1995年 | 40篇 |
1994年 | 32篇 |
1993年 | 26篇 |
1992年 | 23篇 |
1991年 | 17篇 |
1990年 | 17篇 |
1989年 | 17篇 |
1988年 | 15篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 27篇 |
1984年 | 19篇 |
1983年 | 4篇 |
1982年 | 14篇 |
1981年 | 15篇 |
1980年 | 19篇 |
1979年 | 15篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 2篇 |
排序方式: 共有2904条查询结果,搜索用时 31 毫秒
1.
2.
3.
《Discrete Mathematics》2022,345(1):112659
In a recent paper, Gerbner, Patkós, Tuza and Vizer studied regular F-saturated graphs. One of the essential questions is given F, for which n does a regular n-vertex F-saturated graph exist. They proved that for all sufficiently large n, there is a regular -saturated graph with n vertices. We extend this result to both and and prove some partial results for larger complete graphs. Using a variation of sum-free sets from additive combinatorics, we prove that for all , there is a regular -saturated with n vertices for infinitely many n. Studying the sum-free sets that give rise to -saturated graphs is an interesting problem on its own and we state an open problem in this direction. 相似文献
4.
AbstractWe study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results. 相似文献
5.
Influence theory is a foundational theory of physics that is not based on traditional empirically defined concepts, such as positions in space and time, mass, energy, or momentum. Instead, the aim is to derive these concepts, and their empirically determined relationships, from a more primitive model. It is postulated that there exist things, which are call particles, that influence one another in a discrete and directed fashion resulting in a partially ordered set of influence events. The problem of consistent quantification of the influence events is considered. Observers are modeled as particle chains (observer chains) as if an observer were able to track a particle and quantify the influence events that the particle experiences. From these quantified influence events, consistent quantification of the universe of events based on the observer chains is studied. Herein, the kinematics and dynamics of particles from the perspective of influence theory are both reviewed and further developed. 相似文献
6.
7.
8.
《Annals of Pure and Applied Logic》2022,173(8):103135
We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable P-points, definable tight MAD families and definable selective independent families. As a result, we obtain a model in which , each of , , has a witness and there is a well-order of the reals. Note that both the complexity of the witnesses of the above combinatorial cardinal characteristics, as well as the complexity of the well-order are optimal. In addition, we show that the existence of a well-order of the reals is consistent with and each of the following: , , , where the smaller cardinal characteristics have co-analytic witnesses.Our methods allow the preservation of only sufficiently definable witnesses, which significantly differs from other preservation results of this type. 相似文献
9.
预不变凸模糊集的一些性质 总被引:1,自引:0,他引:1
在下半连续的条件下,给出了一个模糊集是预不变凸模糊集的充分条件,并将模糊凸集上相关性质在模糊不变凸集上作了相应的推广.所给出的条件和证明都是新的. 相似文献
10.
Zoltán Lóránt Nagy 《Journal of Graph Theory》2017,84(4):566-580
We study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erd?s and Moser—is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of k‐dominating independent sets in n‐vertex graphs is between and if , moreover the maximum number of 2‐dominating independent sets in n‐vertex graphs is between and . Graph constructions containing a large number of k‐dominating independent sets are coming from product graphs, complete bipartite graphs, and finite geometries. The product graph construction is associated with the number of certain Maximum Distance Separable (MDS) codes. 相似文献